Complexity of Boolean Functions

s of Presentation: Paul Beame: Time-Space Tradeoffs and Multiparty Communication Complexity 9 Beate Bollig: Exponential Lower Bounds for Integer Multiplication Using Universal Hashing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 Philipp Wölfel: On k-wise l-mixed Boolean Functions . . . . . . . . . . . . . . 10 Elizabeta Okol’nishnikova: On One Lower Bound for Branching Programs . . 10 Stanislav Žák: Information Flow in Read-once Branching Programs . . . . . . 11 Jürgen Forster: Bounds on the Dimension and Margin of Arrangements of Half Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 Hans Ulrich Simon: Some Observations Concerning the Rigidity of Matrices . 12 Denis Thérien: Communication Complexity of Regular Languages . . . . . . . 13 Eric Allender: Derandomization Through the Lens of Kolmogorov Complexity – Random Strings are Hard . . . . . . . . . . . . . . . . . . . . . . . . . . 13 Michal Koucký: Universal Exploration Sequences . . . . . . . . . . . . . . . . 14 Valentine Kabanets: The Witness Complexity of Exponential Time . . . . . . . . 14 David A. Mix Barrington: Grid Graph Reachability Problems . . . . . . . . . 15 Stefan Lucks: On the Role of Complexity Theory in Cryptography . . . . . . . 15 Jovan Golic: Low Order Structures and Approximations of Boolean Functions . 16 Anna Gál: On the Size of Self-Avoiding Families – Lower Bounds for Monotone Span Programs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 Akira Maruoka: On derandomization of an algorithm to learn DNF . . . . . . 17 Eli Ben-Sasson: Hard Examples for Bounded Depth Frege . . . . . . . . . . . 17 Thomas Hofmeister: 3-SAT Algorithms with Running Time 1.3302 . . . . . . . 18 Andreas Goerdt: Special Unsatisfiability Algorithms on Random Instances . . . 18 Mikhail V. Alekhnovitch: Satisfiability and Bandwidth . . . . . . . . . . . . . 19 Thomas Thierauf: On the Minimal Polynomial of a Matrix . . . . . . . . . . . 20 Harry Buhrman: Quantum Fingerprinting . . . . . . . . . . . . . . . . . . . . 20 Detlef Sieling: Quantum Branching Programs: Simulations and Upper and Lower Bounds . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 Dieter van Melkebeek: On the Quantum Black-Box Complexity of Majority . . 22 Hartmut Klauck: Lower Bounds on Quantum Communication Complexity . . . 22